package 算法.递归;

public class digui {
    public static void main(String[] args) {
        System.out.println(f(10));
    }

    private static long f(int n) {
        if (n<1) return 0;
        if (n==1) return 1;
        return n+f(n-1);

    }

}
